/*
自己选择的路 ,跪着也要走完。朋友们 , 虽然这个世界日益浮躁起来,只
要能够为了当时纯粹的梦想和感动坚持努力下去 , 不管其它人怎么样,我
们也能够保持自己的本色走下去。
To the world , you will be a person , but to a person , you
will be the world .                               ——AKPower
*/
#include <iostream>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <vector>
#include <map>
#include <queue>
#include <cstdio>
#include <string>
#include <stack>
#include <set>
#define IOS ios::sync_with_stdio(false), cin.tie(0)
using namespace std;
typedef long long ll;

int main()
{
    IOS;
    ll t;
    cin >> t;
    while (t--)
    {
        ll n;
        string com;
        string flag;
        ll num;
        cin >> n;
        cin >> com;
        if (com == "FIFO")
        {
            queue<ll> p;
            while (n--)
            {
                cin >> flag;
                if (flag == "IN")
                {
                    cin >> num;
                    p.push(num);
                }
                else
                {
                    if (p.empty())
                    {
                        cout<<"None"<<endl;
                        continue;
                    }
                    num = p.front();
                    cout<<num<<endl;
                    p.pop();
                }
            }
        }
        else
        {
            stack<ll> p;
            while (n--)
            {
                cin >> flag;
                if (flag == "IN")
                {
                    cin >> num;
                    p.push(num);
                }
                else
                {
                    if (p.empty())
                    {
                        cout<<"None"<<endl;
                        continue;
                    }
                    num = p.top();
                    cout<<num<<endl;
                    p.pop();
                }
            }
        }
    }
    getchar();
    getchar();
    return 0;
}
